Mechanism Design for Value Maximizers

نویسندگان

  • Christopher A. Wilkens
  • Ruggiero Cavallo
  • Rad Niazadeh
چکیده

Bidders often want to get as much as they can without violating constraints on what they spend. For example, advertisers seek to maximize the impressions, clicks, sales, or market share generated by their advertising, subject to budget or return-on-investment (ROI) constraints. Likewise, when bidders have no direct utility for leftover money – e.g., because the money comes from a corporate budget – they will naturally buy as much as possible. We call such bidders value maximizers. The quasilinear utility model dramatically fails to capture these preferences, and so we initiate the study of mechanism design in this different context. In single-parameter settings, we show that any monotone allocation can be implemented truthfully. Interestingly, even in unrestricted domains any choice function that optimizes monotone functions of bidders’ values can be implemented; this contrasts with the case of quasilinear preferences, where Roberts [1979] showed that only affine maximizers are implementable. For general valuations we show that maximizing the value of the highest-value bidder (and iterating through successively lower-value bidders to break ties) is the natural analog of welfare maximization. We apply our results to online advertising as a case study. Firstly, the natural analog of welfare maximization directly generalizes the generalized second price (GSP) auction commonly used to sell search ads. We advocate for this generalization, discussing how it and related hybrid auctions can be used to properly handle the complex ad options available in sponsored search today. Finally, we show that value-maximizing preferences are robust in a practical sense: even though real advertisers’ preferences are complex and varied, as long as outcomes are “sufficiently different,” any advertiser with a moderate ROI constraint and “super-quasilinear” preferences will be behaviorally equivalent to a value maximizer. We empirically evaluate the implications of this, establishing that for at least 80% of a sample of auctions from the Yahoo Gemini Native ads platform, bidders requiring at least a 100% ROI should behave like value maximizers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-player incentive compatible mechanisms are affine maximizers

In mechanism design, for a given type space, there may be incentive compatible mechanisms which are not affine maximizers. We prove that for two-player games on a discrete type space, any given mechanism can be turned into an affine maximizer through a nontrivial perturbation of the type space. Furthermore, our theorem is the strongest possible in this setup. Our proof relies on new results on ...

متن کامل

GSP: The Cinderella of Mechanism Design

Nearly fifteen years ago, Google unveiled the generalized second price (GSP) auction. By all theoretical accounts including their own [29], this was the wrong auction — the Vickrey-Clarke-Groves (VCG) auction would have been the proper choice — yet GSP has succeeded spectacularly. We give a deep justification for GSP’s success: advertisers’ preferences map to a model we call value maximization;...

متن کامل

CS364B: Frontiers in Mechanism Design Lecture #20: Characterization of Revenue-Maximizing Auctions∗

Recall what we are shooting for: a multi-parameter analog of Myerson’s theory of revenuemaximizing optimal auctions. Single-parameter optimal mechanisms are virtual welfare maximizers. We’ve seen that multi-parameter optimal mechanisms are generally randomized. It would seem that the coolest statement that could be true is: revenue-maximizing optimal auctions for multi-parameter problems are al...

متن کامل

X Revenue Maximization and Ex-Post Budget Constraints

We consider the problem of a revenue-maximizing seller with m items for sale to n additive bidders with hard budget constraints, assuming that the seller has some prior distribution over bidder values and budgets. The prior may be correlated across items and budgets of the same bidder, but is assumed independent across bidders. We target mechanisms that are Bayesian Incentive Compatible, but th...

متن کامل

Mechanism Design with Maxmin Agents: Theory and an Application to Bilateral Trade

This paper studies mechanism design when agents are maxmin expected utility maximizers. The …rst result gives a general necessary condition for a social choice rule to be implementable. The condition combines an inequality version of the standard envelope characterization of payo¤s in quasilinear environments with an approach for relating maxmin agents’ subjective expected utilities to their ob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1607.04362  شماره 

صفحات  -

تاریخ انتشار 2016